A Higher Order Iterative Method for Computing the Drazin Inverse

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Higher Order Iterative Method for Computing the Drazin Inverse

A method with high convergence rate for finding approximate inverses of nonsingular matrices is suggested and established analytically. An extension of the introduced computational scheme to general square matrices is defined. The extended method could be used for finding the Drazin inverse. The application of the scheme on large sparse test matrices alongside the use in preconditioning of line...

متن کامل

A Novel Iterative Method for Computing Generalized Inverse

In this letter, we propose a novel iterative method for computing generalized inverse, based on a novel KKT formulation. The proposed iterative algorithm requires making four matrix and vector multiplications at each iteration and thus has low computational complexity. The proposed method is proved to be globally convergent without any condition. Furthermore, for fast computing generalized inve...

متن کامل

The spectral iterative method for Solving Fractional-Order Logistic ‎Equation

In this paper, a new spectral-iterative method is employed to give approximate solutions of fractional logistic differential equation. This approach is based on combination of two different methods, i.e. the iterative method cite{35} and the spectral method. The method reduces the differential equation to systems of linear algebraic equations and then the resulting systems are solved by a numer...

متن کامل

Interpolation algorithm for computing Drazin inverse of polynomial matrices

In this paper we introduce an interpolation method for computing the Drazin inverse of a given polynomial matrix. This method is an extension of the known method from [15], applicable to usual matrix inverse. Also, we improve our interpolation method, using a more effective estimation of degrees of polynomial matrices generated in Leverrier-Faddev method. Algorithms are implemented and tested i...

متن کامل

An accelerated iterative method for computing weighted Moore-Penrose inverse

The goal of this paper is to present an accelerated iterative method for computing weighted Moore–Penrose inverse. Analysis of convergence is included to show that the proposed scheme has sixth-order convergence. Using a proper initial matrix, a sequence of iterates will be produced, which is convergent to the weighted Moore–Penrose inverse. Numerical experiments are reported to show the effici...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Scientific World Journal

سال: 2013

ISSN: 1537-744X

DOI: 10.1155/2013/708647